全文获取类型
收费全文 | 56925篇 |
免费 | 7703篇 |
国内免费 | 5569篇 |
专业分类
化学 | 17044篇 |
晶体学 | 203篇 |
力学 | 4864篇 |
综合类 | 677篇 |
数学 | 31730篇 |
物理学 | 15679篇 |
出版年
2024年 | 98篇 |
2023年 | 657篇 |
2022年 | 796篇 |
2021年 | 1159篇 |
2020年 | 1890篇 |
2019年 | 1903篇 |
2018年 | 1670篇 |
2017年 | 1735篇 |
2016年 | 2190篇 |
2015年 | 1978篇 |
2014年 | 2959篇 |
2013年 | 5153篇 |
2012年 | 3086篇 |
2011年 | 3576篇 |
2010年 | 3242篇 |
2009年 | 3700篇 |
2008年 | 3885篇 |
2007年 | 3904篇 |
2006年 | 3363篇 |
2005年 | 3096篇 |
2004年 | 2572篇 |
2003年 | 2477篇 |
2002年 | 2221篇 |
2001年 | 1758篇 |
2000年 | 1490篇 |
1999年 | 1390篇 |
1998年 | 1265篇 |
1997年 | 1095篇 |
1996年 | 850篇 |
1995年 | 733篇 |
1994年 | 594篇 |
1993年 | 440篇 |
1992年 | 410篇 |
1991年 | 362篇 |
1990年 | 290篇 |
1989年 | 220篇 |
1988年 | 201篇 |
1987年 | 189篇 |
1986年 | 188篇 |
1985年 | 216篇 |
1984年 | 183篇 |
1983年 | 99篇 |
1982年 | 175篇 |
1981年 | 155篇 |
1980年 | 124篇 |
1979年 | 127篇 |
1978年 | 83篇 |
1977年 | 63篇 |
1976年 | 62篇 |
1973年 | 30篇 |
排序方式: 共有10000条查询结果,搜索用时 140 毫秒
1.
使用Galerkin方法,结合Sobolev空间理论和不等式技巧,给出了广义神经传播方程解的存在唯一性定理,然后利用吸引子存在性定理,采用半群方法证明了方程整体吸引子的存在性. 相似文献
2.
针对公众参与的语言信息多属性群决策问题,研究了考虑参与者满意度的概率语言多属性群决策方法。首先,根据参与者的语言评价信息确定并规范化概率语言决策矩阵。然后,对大群体进行共识分析,由最大化参与者群体的满意度构建线性规划模型,确定参与者群组的权重;构造正、负理想方案的评价向量,构建多目标规划模型,用拉格朗日乘子法求解属性权重;定义各方案的加权贴近度,并以此对方案进行排序和优选。最后,通过新型智慧城市市民获得感评价案例验证了模型的可行性和有效性。 相似文献
3.
In this article a coupled version of the improved divergence‐free‐condition compensated method will be proposed to simulate time‐varying geometries by direct forcing immersed boundary method. The proposed method can be seen as a quasi‐multi‐moment framework due to the fact that the momentum equations are discretized by both cell‐centered and cell‐face velocity. For simulating time‐varying geometries, a semi‐implicit iterative method is proposed for calculating the direct forcing terms. Treatments for suppressing spurious force oscillations, calculating drag/lift forces, and evaluating velocity and pressure for freshly cells will also be addressed. In order to show the applicability and accuracy, analytical as well as benchmark problems will be investigated by the present framework and compared with other numerical and experimental results. 相似文献
4.
A finite support product of clones of Jensen's minimal singleton forcing is used to define a model in which any non-empty analytically definable set of reals contains an analytically definable real (the full basis theorem), but there is no analytically definable wellordering of the reals. 相似文献
5.
Due to their intrinsic link with nonlinear Fokker-Planck equations and many other applications, distribution dependent stochastic differential equations (DDSDEs) have been intensively investigated. In this paper, we summarize some recent progresses in the study of DDSDEs, which include the correspondence of weak solutions and nonlinear Fokker-Planck equations, the well-posedness, regularity estimates, exponential ergodicity, long time large deviations, and comparison theorems. 相似文献
6.
The aim of this paper is to study the asymptotic behavior of solutions for some reaction–diffusion systems in biology. First, we establish a Liouville type theorem for entire solutions of these reaction–diffusion systems. Based on this theorem, we derive the stabilization of the solutions of the reaction–diffusion system to the unique positive constant state, under the condition that this positive constant state is globally stable in the corresponding kinetic systems. Two specific examples about spreading phenomena from ecology and epidemiology are given to illustrate the application of this theory. 相似文献
7.
《Mendeleev Communications》2022,32(4):467-470
Isomeric forms of indoline spiropyrans show unusual behavior compared with similar compounds, according to experimental data. DFT modeling for gas phase was made to consider the simplest case without environmental effects, which revealed the intramolecular reasons for occurrence of ring opening reaction depending on the particular structure of the compound. The questions of charge redistributions, the changes of geometry and chemical bonds in the structures are also discussed. 相似文献
8.
9.
10.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献